Cappable Cea Sets and Ramsey’s Theorem
نویسندگان
چکیده
We begin a search for degree-theoretic properties that might be used to separate Ramsey’s Theorem for pairs from its stable version in the Reverse Mathematical sense. This paper introduces the notion of c-cappability and shows that this property cannot be used to obtain such a separation when combined with
منابع مشابه
(Un)countable and (non)effective versions of Ramsey’s theorem
We review Ramsey’s theorem and its extensions by Jockusch for computable partitions, by Sierpiński and by Erdős and Rado for uncountable homogeneous sets, by Rubin for automatic partitions, and by the author for ω-automatic (in particular uncountable) partitions.
متن کاملStable Ramsey's Theorem and Measure
The stable Ramsey’s theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a certain effective measure-theoretic sense. We show that the sets that can compute infinite homogeneous sets for non-null many computable stable colorings and ...
متن کاملThe polarized Ramsey's theorem
We study the effective and proof-theoretic content of the polarized Ramsey’s theorem, a variant of Ramsey’s theorem obtained by relaxing the definition of homogeneous set. Our investigation yields a new characterization of Ramsey’s theorem in all exponents, and produces several combinatorial principles which, modulo bounding for Σ2 formulas, lie (possibly not strictly) between Ramsey’s theorem ...
متن کاملRamsey’s Theorem for pairs in k colors in the hierarchy of classical principles
The purpose of this work is to study, from the viewpoint of first order arithmetic (we have no set variables, the only sets are the arithmetical sets), Ramsey’s Theorem for pairs for a recursive assignment of k-many colors in order to find some principle of classical logic equivalent to it in HA. We proved that it is equivalent in HA to Σ3-LLPO, that is the Limited Lesser Principle of Omniscien...
متن کاملNash-williams’ Argument in Infinite Ramsey Theory as an Induction Principle
In [2], Nash-Williams found an extension of the proof of Ramsey’s theorem [3] that turned out to be of utmost importance in infinite Ramsey theory. He employed his argument to carry over Ramsey’s theorem to certain families of finite subsets of N (see also [4, Theorem 1.14]). Later, stimulated by work of Galvin and Prikry on an extension of Ramsey’s theorem to families of infinite subsets of N,...
متن کامل